Risk Bounds for Random Regression Graphs
نویسندگان
چکیده
منابع مشابه
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The partitions are iteratively constructed by suitable random merges and splits, using cuts of arbitrary geometry. We give a risk bound under the assumption that a “weak learning hypothesis” holds, and characterize this hyp...
متن کاملBernoulli Graph Bounds for General Random Graphs∗
General random graphs (i.e., stochastic models for networks incorporating heterogeneity and/or dependence among edges) are increasingly widely used in the study of social and other networks, but few techniques other than simulation have been available for studying their behavior. Random graphs with independent edges (i.e., the Bernoulli graphs), on the other hand, are well-studied, and a large ...
متن کاملEntrywise Bounds for Eigenvectors of Random Graphs
Let G be a graph randomly selected from Gn,p, the space of Erdős-Rényi Random graphs with parameters n and p, where p > log 6 n n . Also, let A be the adjacency matrix of G, and v1 be the first eigenvector of A. We provide two short proofs of the following statement: For all i ∈ [n], for some constant c > 0
متن کاملRisk Bounds in Isotonic Regression
Nonasymptotic risk bounds are provided for maximum likelihood-type isotonic estimators of an unknown nondecreasing regression function, with general average loss at design points. These bounds are optimal up to scale constants, and they imply uniform n−1/3-consistency of the p risk for unknown regression functions of uniformly bounded variation, under mild assumptions on the joint probability d...
متن کاملRisk bounds for purely uniformly random forests
Random forests, introduced by Leo Breiman in 2001, are a very effective statistical method. The complex mechanism of the method makes theoretical analysis difficult. Therefore, a simplified version of random forests, called purely random forests, which can be theoretically handled more easily, has been considered. In this paper we introduce a variant of this kind of random forests, that we call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2007
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-006-0217-2